A weighted min-max relation for intervals
نویسندگان
چکیده
منابع مشابه
Task Decomposition Using Geometric Relation for Min-Max Modular SVMs
The min-max modular support vector machine (M-SVM) was proposed for dealing with large-scale pattern classification problems. M-SVM divides training data to several sub-sets, and combine them to a series of independent sub-problems, which can be learned in a parallel way. In this paper, we explore the use of the geometric relation among training data in task decomposition. The experimental resu...
متن کاملA Min-Max Relation on Packing Feedback Vertex Sets
Let G be a graph with a nonnegative integral function w defined on V (G). A collection F of subsets of V (G) (repetition is allowed) is called a feedback vertex set packing in G if the removal of any member of F from G leaves a forest, and every vertex v ∈ V (G) is contained in at most w(v) members of F . The weight of a cycle C in G is the sum of w(v), over all vertices v of C. The purpose of ...
متن کاملPolynomial Min/Max-weighted Reachability is in Unambiguous Log-space
For a graph G(V,E) and a vertex s ∈ V , a weighting scheme (w : E → N) is called a min-unique (resp. max-unique) weighting scheme, if for any vertex v of the graph G, there is a unique path of minimum(resp. maximum) weight1 from s to v. Instead, if the number of paths of minimum(resp. maximum) weight is bounded by n for some constant c, then the weighting scheme is called a min-poly (resp. max-...
متن کاملGeneralized Min-Max Kernel and Generalized Consistent Weighted Sampling
We propose the “generalized min-max” (GMM) kernel as a measure of data similarity, where data vectors can have both positive and negative entries. GMM is positive definite as there is an associate hashing method named “generalized consistent weighted sampling” (GCWS) which linearizes this (nonlinear) kernel. A natural competitor of GMM is the radial basis function (RBF) kernel, whose correspond...
متن کاملMaximum Flow Routing with Weighted Max-Min Fairness
Max-min is an established fairness criteria for allocating bandwidth for flows. In this work we look at the combined problem of routing and bandwidth allocation such that the flow allocation for each connection will be maximized and fairness will be maintained. We use the weighted extension of the max-min criteria to allocate bandwidth proportionaly to the flows’ demand. Our contribution is an ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1991
ISSN: 0095-8956
DOI: 10.1016/0095-8956(91)90073-s